A simplified NP-complete satisfiability problem
نویسندگان
چکیده
منابع مشابه
A simplified NP-complete satisfiability problem
Cook [l] has shown that 3-SAT, the Boolean satisfiability problem restricted to instances with exactly three variables per clause, is NP-complete. This is a tightest possible restriction on the number of variables in a clause because as Even et al. [2] demonstrate, 2-SAT is in P. Horowitz and Sahni [5] point up the importance of finding the strongest possible restrictions under which a problem ...
متن کاملA Simplified NP-Complete MAXSAT Problem
It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even the general MAXSAT problem) can be solved in linear time. When every variable appears in at most three clauses, we give an exact algorithm for MAXSAT that takes at most O(3 n=2 n) steps where n is th...
متن کاملThe k-Satisfiability problem remains NP-complete for dense families
We consider the ~ATISFIABILITY problem (~-SAT): Given a family F of n clauses cl, ._, , c, in conjunctive normal form, each consisting of k literals corresponding to k different variables of a set of r 2 k 2 1 boolean variables, is F satisfiable? By k-SAT@ no) we denote the k-SAT problem restricted to families with n > n,(r) clauses. We prove that for each k > 3 and each integer I > 4 such that...
متن کاملSimplified Harvest Moon is NP-Complete
Recently, some significant work has been done to analyze the complexity class of classic electronic games. In these works, the rules of the game are generalized and then the generalized games are classified by formulating them as a decision problem and reducing them to a problem known to be NP-complete [1, 2]. We use a similar approach to prove the complexity class of a particular class of mode...
متن کاملFirst-order satisfiability in Gödel logics: An NP-complete fragment
Defined over sets of truth values V which are closed subsets of [0, 1] containing both 0 and 1, Gödel logics GV are prominent examples of many-valued logics. We investigate a first-order fragment of GV extended with ∆ that is powerful enough to formalize important properties of fuzzy rule-based systems. The satisfiability problem in this fragment is shown to be NP-complete for all GV , also in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90081-7